TSTP Solution File: SEV410^5 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SEV410^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 19:24:55 EDT 2023
% Result : Theorem 3.49s 3.81s
% Output : Proof 3.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEV410^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15 % Command : duper %s
% 0.15/0.36 % Computer : n017.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 24 01:43:39 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.49/3.81 SZS status Theorem for theBenchmark.p
% 3.49/3.81 SZS output start Proof for theBenchmark.p
% 3.49/3.81 Clause #0 (by assumption #[]): Eq (Not ((cP fun Xx => Or (cA Xx) (cB Xx)) → Exists fun Xu => And (cP Xu) (∀ (Xx : Iota), cA Xx → Xu Xx))) True
% 3.49/3.81 Clause #1 (by clausification #[0]): Eq ((cP fun Xx => Or (cA Xx) (cB Xx)) → Exists fun Xu => And (cP Xu) (∀ (Xx : Iota), cA Xx → Xu Xx)) False
% 3.49/3.81 Clause #2 (by clausification #[1]): Eq (cP fun Xx => Or (cA Xx) (cB Xx)) True
% 3.49/3.81 Clause #3 (by clausification #[1]): Eq (Exists fun Xu => And (cP Xu) (∀ (Xx : Iota), cA Xx → Xu Xx)) False
% 3.49/3.81 Clause #4 (by clausification #[3]): ∀ (a : Iota → Prop), Eq (And (cP a) (∀ (Xx : Iota), cA Xx → a Xx)) False
% 3.49/3.81 Clause #5 (by clausification #[4]): ∀ (a : Iota → Prop), Or (Eq (cP a) False) (Eq (∀ (Xx : Iota), cA Xx → a Xx) False)
% 3.49/3.81 Clause #6 (by clausification #[5]): ∀ (a : Iota → Prop) (a_1 : Iota), Or (Eq (cP a) False) (Eq (Not (cA (skS.0 0 a a_1) → a (skS.0 0 a a_1))) True)
% 3.49/3.81 Clause #7 (by clausification #[6]): ∀ (a : Iota → Prop) (a_1 : Iota), Or (Eq (cP a) False) (Eq (cA (skS.0 0 a a_1) → a (skS.0 0 a a_1)) False)
% 3.49/3.81 Clause #8 (by clausification #[7]): ∀ (a : Iota → Prop) (a_1 : Iota), Or (Eq (cP a) False) (Eq (cA (skS.0 0 a a_1)) True)
% 3.49/3.81 Clause #9 (by clausification #[7]): ∀ (a : Iota → Prop) (a_1 : Iota), Or (Eq (cP a) False) (Eq (a (skS.0 0 a a_1)) False)
% 3.49/3.81 Clause #10 (by superposition #[8, 2]): ∀ (a : Iota), Or (Eq (cA (skS.0 0 (fun Xx => Or (cA Xx) (cB Xx)) a)) True) (Eq False True)
% 3.49/3.81 Clause #11 (by superposition #[9, 2]): ∀ (a : Iota), Or (Eq ((fun Xx => Or (cA Xx) (cB Xx)) (skS.0 0 (fun Xx => Or (cA Xx) (cB Xx)) a)) False) (Eq False True)
% 3.49/3.81 Clause #13 (by clausification #[10]): ∀ (a : Iota), Eq (cA (skS.0 0 (fun Xx => Or (cA Xx) (cB Xx)) a)) True
% 3.49/3.81 Clause #15 (by betaEtaReduce #[11]): ∀ (a : Iota),
% 3.49/3.81 Or (Eq (Or (cA (skS.0 0 (fun Xx => Or (cA Xx) (cB Xx)) a)) (cB (skS.0 0 (fun Xx => Or (cA Xx) (cB Xx)) a))) False)
% 3.49/3.81 (Eq False True)
% 3.49/3.81 Clause #17 (by clausification #[15]): ∀ (a : Iota), Or (Eq False True) (Eq (cA (skS.0 0 (fun Xx => Or (cA Xx) (cB Xx)) a)) False)
% 3.49/3.81 Clause #25 (by clausification #[17]): ∀ (a : Iota), Eq (cA (skS.0 0 (fun Xx => Or (cA Xx) (cB Xx)) a)) False
% 3.49/3.81 Clause #26 (by superposition #[25, 13]): Eq False True
% 3.49/3.81 Clause #28 (by clausification #[26]): False
% 3.49/3.81 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------